Circumscribed sphere of a convex polyhedron

نویسندگان

  • Mao-Ting Chien
  • Hiroshi Nakazato
چکیده

Suppose that K is a convex polyhedron in the n-dimensional Euclidean space R. Suppose that the extreme points of K are P1, P2, . . . , Pm ( m ≥ n + 1). If P is an arbitrary interior point of K, then there exist vertices Pi1 , Pi2 , . . . , Pin+1 of K and a point Q of R n and a positive number r > 0 for which ||Pik − Q|| = r for 1 ≤ k ≤ n + 1 , ||Pj − Q|| ≤ r for 1 ≤ j ≤ m and P is an interior point of the ndimensional simplex with vertices Pi1 , . . . , Pin+1 . This result is related with the q-numerical range of a normal operator. Suppose that T is a bounded linear operator on a complex Hilbert space H and q is a positive number with 0 ≤ q ≤ 1. The q-numerical range Wq(T ) of T is defined as {〈Tx, y〉 : x, y ∈ H, 〈x, x〉 = 〈y, y〉 = 1, 〈x, y〉 = q}.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inscribed and Circumscribed Polyhedra for a Convex Body and Continuous Functions on a Sphere in Euclidean Space

Two related problems concerning continuous functions on a sphere Sn−1 ⊂ Rn are studied, together with the problem of finding a family of polyhedra in Rn one of which is inscribed in (respectively, circumscribed about) a given smooth convex body in Rn. In particular, it is proved that, in every convex body K ⊂ R3, one can inscribe an eight-vertex polyhedron obtained by “equiaugmentation” of a si...

متن کامل

The Roundest Polyhedra with Symmetry Constraints

Amongst the convex polyhedra with n faces circumscribed about the unit sphere, which has the minimum surface area? This is the isoperimetric problem in discrete geometry which is addressed in this study. The solution of this problem represents the closest approximation of the sphere, i.e., the roundest polyhedra. A new numerical optimization method developed previously by the authors has been a...

متن کامل

Cutting a Convex Polyhedron Out of a Sphere

Given a convex polyhedron P of n vertices inside a sphere Q, we give an O(n)-time algorithm that cuts P out of Q by using guillotine cuts and has cutting cost O(log n) times the optimal.

متن کامل

Approximation of Smooth Convex Bodies by Random Circumscribed Polytopes

Choose n independent random points on the boundary of a convex body K ⊂Rd . The intersection of the supporting halfspaces at these random points is a random convex polyhedron. The expectations of its volume, its surface area and its mean width are investigated. In the case that the boundary of K is sufficiently smooth, asymptotic expansions as n→∞ are derived even in the case when the curvature...

متن کامل

The Polyhedra of Maximal Volume Inscribed in the Unit Sphere and of Minimal Volume Circumscribed about the Unit Sphere

In this paper, we consider two classes of polyhedra. One is the class of polyhedra of maximal volume with n vertices that are inscribed in the unit sphere of R. The other class is polyhedra of minimal volume with n vertices that are circumscribed about the unit sphere of R. We construct such polyhedra for n up to 30 by a computer aided search and discuss some of their properties.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Appl. Math. Lett.

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2005